Computation tree logic

Results: 41



#Item
21Overview  Modelling  Deterministic finite automata Algorithmic Verification

Overview  Modelling  Deterministic finite automata Algorithmic Verification

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-06-05 00:33:08
22BRICS Basic Research in Computer Science MONA Version 1.4 User Manual Nils Klarlund, [removed]

BRICS Basic Research in Computer Science MONA Version 1.4 User Manual Nils Klarlund, [removed]

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2002-06-14 03:00:12
23The Combinatorics of Non-determinism∗ ´ eric ´ Peschanski‡ . Olivier Bodini†, Antoine Genitrini‡and Fred [removed], {Antoine.Genitrini,Frederic.Peschanski}@lip6.fr.

The Combinatorics of Non-determinism∗ ´ eric ´ Peschanski‡ . Olivier Bodini†, Antoine Genitrini‡and Fred [removed], {Antoine.Genitrini,Frederic.Peschanski}@lip6.fr.

Add to Reading List

Source URL: www-apr.lip6.fr

Language: English - Date: 2013-12-05 10:18:28
24A Concrete Presentation of Game Semantics W. Blum∗ C.-H. L. Ong†  Abstract

A Concrete Presentation of Game Semantics W. Blum∗ C.-H. L. Ong† Abstract

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2012-01-14 04:37:24
25Advanced Topics in Combinatorial Methods for Testing

Advanced Topics in Combinatorial Methods for Testing

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2014-09-04 15:52:31
26Theory Comput Syst DOI[removed]s00224[removed]Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

Theory Comput Syst DOI[removed]s00224[removed]Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

Add to Reading List

Source URL: web.ing.puc.cl

Language: English - Date: 2013-04-26 05:57:02
27May 27, [removed]:33 WSPC/117-IJSEKE S021819401100513X  -

May 27, [removed]:33 WSPC/117-IJSEKE S021819401100513X -

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2014-02-03 09:41:10
28ACM 2007 Turing Award Edmund Clarke, Allen Emerson, and Joseph Sifakis Model Checking: Algorithmic Verification and Debugging ACM Turing Award Citation In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA,

ACM 2007 Turing Award Edmund Clarke, Allen Emerson, and Joseph Sifakis Model Checking: Algorithmic Verification and Debugging ACM Turing Award Citation In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA,

Add to Reading List

Source URL: www-verimag.imag.fr

Language: English - Date: 2012-12-31 04:25:30
29Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed]  Abstract. We prove that the computational problem of finding backward induc

Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc

Add to Reading List

Source URL: jakubszymanik.com

Language: English - Date: 2013-07-13 09:14:28
30CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t

CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:58:40